The Shortest-Edge Duplication of Triangles
نویسندگان
چکیده
We introduce a new triangle transformation, the shortest-edge (SE) duplication, as natural way of mesh derefinement suitable to those meshes obtained by iterative application longest-edge bisection refinement. Metric properties SE duplication in region normalised triangles endowed with Poincare hyperbolic metric are studied. The self-improvement this transformation is easily proven, well minimum angle condition. give lower bound for maximum smallest angles produced α=π6. This does not depend on shape initial triangle.
منابع مشابه
Edge-Constrained Marching Triangles
Marching triangles is a method for producing a polygon mesh surface approximation composed of triangular facets which are approximately equilateral. This paper improves the Marching Triangles algorithm where the inputs are multiple range images of scenes. C discontinuities (fold edges) are detected and used to constrain the final triangulation, thus increasing the accuracy of the mesh at sharp ...
متن کاملMany Empty Triangles have a Common Edge
Given a finite point set X in the plane, the degree of a pair {x, y} ⊂ X is the number of empty triangles t = conv{x, y, z}, where empty means t∩X = {x, y, z}. Define degX as the maximal degree of a pair in X. Our main result is that if X is a random sample of n independent and uniform points from a fixed convex body, then degX ≥ cn/ lnn in expectation.
متن کاملPacking Edge-Disjoint Triangles in Given Graphs
Given a graph G, we consider the problem of finding the largest set of edge-disjoint triangles contained in G. We show that even the simpler case of decomposing the edges of a sparse split graph G into edge-disjoint triangles is NP-complete. We show next that the case of a general G can be approximated within a factor of 3 5 in polynomial time, and is NP-hard to approximate within some constant...
متن کاملPacking Edge Disjoint Triangles: A Parameterized View
The problem of packing k edge-disjoint triangles in a graph has been thoroughly studied both in the classical complexity and the approximation fields and it has a wide range of applications in many areas, especially computational biology [BP96]. In this paper we present an analysis of the problem from a parameterized complexity viewpoint. We describe a fixed-parameter tractable algorithm for th...
متن کاملEdge colorings of complete graphs without tricolored triangles
We show some consequences of results of Gallai concerning edge colorings of complete graphs that contain no tricolored triangles. We prove two conjectures of Bialostocki and Voxman about the existence of special monochromatic spanning trees in such colorings. We also determine the size of largest monochromatic stars guaranteed to occur. 2004 Wiley Periodicals, Inc. J Graph Theory 46: 211–216, 2004
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Mathematics
سال: 2022
ISSN: ['2227-7390']
DOI: https://doi.org/10.3390/math10193643